Bounds on the generating functions of certain smoothing operations

On composition of generating functions

In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...

Certain Coefficient Bounds for p-Valent Functions

Performance bounds for queues via generating functions

Modern applications, e.g. vlsi manufacturing, give rise to complicated queueing models, often of the re-entrant type. Their complexity, together with implications of their performance, renewed interest in their performance and the computation of good control (e.g. scheduling) policies. Recent work concentrated on computable (mostly linear) performance bounds. We show that the linear bounds can ...

Bounds for the second Hankel determinant of certain univalent functions

*Correspondence: [email protected] 1School of Mathematical Sciences, Universiti Sains Malaysia, 11800 USM, Penang, Malaysia Full list of author information is available at the end of the article Abstract The estimates for the second Hankel determinant a2a4 – a3 of the analytic function f (z) = z + a2z + a3z + · · · , for which either zf ′(z)/f (z) or 1 + zf ′′(z)/f ′(z) is subordinate to a certai...

study of hash functions based on chaotic maps

توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...